A PSO-based algorithm designed for a swarm of mobile robots
نویسندگان
چکیده
This paper presents an algorithm called augmented Lagrangian particle swarm optimization with velocity limits (VL-ALPSO). It uses a particle swarm optimization (PSO) based algorithm to optimize the motion planning for swarm mobile robots. Considering problems with engineering constraints and obstacles in the environment, the algorithm combines the method of augmented Lagrangian multipliers and strategies of velocity limits and virtual detectors so as to ensure enforcement of constraints, obstacle avoidance and mutual avoidance. All the strategies together with basic PSO are corresponding to real situations of swarm mobile robots in coordinated movements. This work also builds a swarm motion model based on Euler forward time integration that involves some mechanical properties such as masses, inertias or external forces to the swarm robotic system. Simulations show that the robots moving in the environment display the desired behavior. Each robot has the ability to do target searching, obstacle avoidance, random wonder, acceleration or deceleration and escape entrapment. So, in summary due to the characteristic features of the VL-ALPSO algorithm, after some engineering adaptation, it can work well for the planning of coordinated movements of swarm robotic systems. Q. Tang · P. Eberhard (B) Institute of Engineering and Computational Mechanics, University of Stuttgart, Pfaffenwaldring 9, 70569 Stuttgart, Germany e-mail: [email protected] Q. Tang e-mail: [email protected]
منابع مشابه
PSO-Based Path Planning Algorithm for Humanoid Robots Considering Safety
In this paper we introduce an improvement in the path planning algorithm for the humanoid soccer playing robot which uses Ferguson splines and PSO (Particle Swarm Optimization). The objective of the algorithm is to find a path through other playing robots to the ball, which should be as short as possible and also safe enough. Ferguson splines create preliminary paths using random generated para...
متن کاملPath Planning in Swarm Robots using Particle Swarm Optimisation on Potential Fields
This article presents a novelimplementation of Particle Swarm Optimisation(PSO)forfinding the most optimal solution to path planning problem for a swarm of robots. The swarm canvasses through the configuration space having static obstaclesby applying PSO on potential fields generated by the target. The best possible path by the momentary leaders of the group is retraced toget the solution. The ...
متن کاملA New Propulsion System for Microswimmer Robot and Optimizing Geometrical Parameters Using PSO Algorithm
Mini and micro robots, which can swim in an underwater environment, have drawn widespread research interests because of their potential applications to the clinical drug delivery, biotechnology, manufacturing, mobile sensor networks, etc. In this paper, a prototype of microrobot based on the motion principle of living microorganisms such as E. Coli Bacteria is presented. The properties of this ...
متن کاملAnalysis of Multi-Robots Transportation with Multi-objective PSO Algorithm in an Artificial Capital Market
In this paper, to analyze the transport of autonomous robots, an artificial Capital market is used. Capital market is considered as a pier which loading and unloading of cargo is done. Autonomous robots load and unload from the ship to the warehouse wharf or vice versa. All the robots have the ability of transporting the loads, but depending on loads and the location of unloading (or loading) a...
متن کاملDesigning an Optimal Stable Algorithm for Robot Swarm Motion toward a Target
In this paper, an optimal stable algorithm is presented for members of a robots swarm moving toward a target. Equations of motion of the swarm are based on Lagrangian energy equations. Regarding of similar research On the design of swarm motion algorithm, an equation of motion considered constraints to guarantee no collision between the members and the members and obstacles along the motion pat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011